Futures Literacy — Embracing Complexity and Using the Future | Riel Miller 23 Opinion Riel Miller

Source URL: www.rielmiller.com

• Futurology
• Science
• Environmental economics
• Prediction
• Technology forecasting
• Futures studies
• Foresight
• Anticipation
• Futurist
• Time
• Future
• Anticipatory thinking

Regular Linear-time Temporal Logic Martin Leucker Institut f¨ur Informatik TU M¨unchenGarching, Germany Email:

Source URL: software.imdea.org

• Formal languages
• Logic in computer science
• Complexity classes
• Automata theory
• Temporal logic
• Linear temporal logic
• Modal logic
• Dynamic logic
• Model checking
• Theoretical computer science
• Mathematics
• Logic

Online Discovery of Top-k Similar Motifs in Time Series Data Hoang Thanh Lam1 , Ninh Dang Pham2 and Toon Calders1 1 Department of Math. and Computer Science

Source URL: www.win.tue.nl

• Search algorithms
• Analysis of algorithms
• K-nearest neighbor algorithm
• Time complexity
• Pi
• Algorithm
• Nearest neighbor search
• Euclidean algorithm
• Theoretical computer science
• Mathematics
• Applied mathematics

SIAM J. COMPUT. Vol. 39, No. 7, pp. 3248–3282 c 2010 Society for Industrial and Applied Mathematics 

Source URL: www.cims.nyu.edu

• Applied mathematics
• Largest empty rectangle
• Geometry
• Exponentiation
• Open set
• Time complexity
• Mathematics
• Computational geometry
• Ε-net

Efficient Sensor Placement for Surveillance Problems⋆ Pankaj K. Agarwal, Esther Ezra, and Shashidhara Ganjugunte Dept. of Comp. Sci., Duke University, Durham, NCAbstract. We study the problem of covering a

Source URL: www.cims.nyu.edu

• Computational geometry
• Analysis of algorithms
• Ε-net
• Time complexity
• Art gallery problem
• Algorithm
• Randomized algorithm
• Sensor
• SL
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

2010 Paper 7 Question 5 Bioinformatics (a) Discuss the space–time complexity of dynamic programming algorithms in sequence alignment. [7 marks]

Source URL: www.cl.cam.ac.uk

Approximate Parameterized Matching CARMIT HAZAY AND MOSHE LEWENSTEIN Bar-Ilan University AND DINA SOKOL

Source URL: www.eng.biu.ac.il

• String matching algorithms
• Analysis of algorithms
• Donald Knuth
• Knuth–Morris–Pratt algorithm
• String searching algorithm
• Matching
• Time complexity
• Suffix tree
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Memory Bounded Inference in Topic Models Ryan Gomes GOMES @ VISION . CALTECH . EDU Dept. of Computation and Neural Systems, California Institute of Technology, Pasadena, CAUSA Max Welling

Source URL: www.ics.uci.edu

• Estimation theory
• Expectation–maximization algorithm
• Missing data
• Mixture model
• Latent Dirichlet allocation
• Dirichlet process
• Time complexity
• Calculus of variations
• Statistics
• Theoretical computer science
• Statistical natural language processing

A Mergeable Summaries Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, and Ke Yi We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two

Source URL: www.cs.utah.edu

• Mathematics
• Algorithms
• Streaming algorithm
• Time complexity
• Quantile
• Applied mathematics
• Computational complexity theory
• Computer science

UltraFastTM Market Data Optimized real-time market data solutions delivered at the lowest latencies. Where and how you need it. Increasing market complexity is driving higher data volumes and demanding faster speeds, req

Source URL: www.cfnservices.com